منابع مشابه
Splitting trees
Splitting a tree is defined as removing all edges of a chain and disconnecting one from the other edges incident with that chain. Splitting a forest is simultaneously splitting each of its non-trivial trees. The splitting number a(T) of a tree T is the minimum number of successive forest splittings which lead to deletion of all of T’s edges. An O(N) algorithm is proposed to get an upper bound c...
متن کاملSplitting trees at vertices
We present tight bounds on splitting trees into “small” subtrees.
متن کاملBoosting trees for clause splitting
We present a system for the CoNLL shared task the clause splitting problem Our ap proach consists in decomposing the clause split ting problem into a combination of binary sim ple decisions which we solve with the Ada Boost learning algorithm The whole problem is decomposed in two levels with two chained decisions per level The rst level corresponds to parts and presented in the introductory do...
متن کاملA Beta-splitting model for evolutionary trees
In this article, we construct a generalization of the Blum-François Beta-splitting model for evolutionary trees, which was itself inspired by Aldous' Beta-splitting model on cladograms. The novelty of our approach allows for asymmetric shares of diversification rates (or diversification 'potential') between two sister species in an evolutionarily interpretable manner, as well as the addition of...
متن کاملOn Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be split (bipartitioned) with the goal of minimizing resultant expected query time. The previous algorithm for optimal node splitting requires exponential time. One contribution of this paper is a polynomial time algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00187-2